Fast and Stable Rational Interpolation in Roots of Unity and Chebyshev Points
نویسندگان
چکیده
منابع مشابه
Fast and Stable Rational Interpolation in Roots of Unity and Chebyshev Points
A new method for interpolation by rational functions of prescribed numerator and denominator degrees is presented. When the interpolation nodes are roots of unity or Chebyshev points, the algorithm is particularly simple and relies on discrete Fourier transform matrices, which results in a fast implementation using the Fast Fourier Transform. The method is generalised for arbitrary grids, which...
متن کاملRational Interpolation at Chebyshev points
The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...
متن کاملFast Evaluation and Interpolation at the Chebyshev Sets of Points
Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O(nlog’ n) arithmetic operations, to be compared with customary algorithms either using on the order of n* operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O(dlog d log n) if n 5 d...
متن کاملNewton Interpolation in Fejér and Chebyshev Points
Let T be a Jordan curve in the complex plane, and let Í) be the compact set bounded by T. Let / denote a function analytic on O. We consider the approximation of / on fî by a polynomial p of degree less than n that interpolates / in n points on T. A convenient way to compute such a polynomial is provided by the Newton interpolation formula. This formula allows the addition of one interpolation ...
متن کاملStable Computation of the Complex Roots of Unity Stable Computation of the Complex Roots of Unity
In this paper, we show that the problem of computing the complex roots of unity is not as simple as it seems at rst. In particular, the formulas given in a standard programmer's reference book Knuth, Seminumerical Algorithms, 1981] are shown to be numerically unstable, giving unacceptably large error for moderate sized sequences. We give alternative formulas, which we show to be superior both b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2012
ISSN: 0036-1429,1095-7170
DOI: 10.1137/100797291